An Improved Self-organizing Map Approach to Traveling Salesman Problem
نویسندگان
چکیده
In this paper, an improved self-organizing map approach to solving the traveling salesman problem is proposed by fixing the number of nodes in the output layer of neural network, modifying the neighhorhood function, and modifying the weight update rules. An overview of previous work on solving the traveling salesman problem is given. An extension of the prcposed algorithm can also be used to solve multiple traveling salesman problem and robot path planning. The simulation results demonstrate that the proposed algorithm is capable of providing a better solution within a reasonable time and much faster than conventional self-organizing map algorithms.
منابع مشابه
A Neural-Network-Based Approach to the Double Traveling Salesman Problem
The double traveling salesman problem is a variation of the basic traveling salesman problem where targets can be reached by two salespersons operating in parallel. The real problem addressed by this work concerns the optimization of the harvest sequence for the two independent arms of a fruit-harvesting robot. This application poses further constraints, like a collision-avoidance function. The...
متن کاملSelf-Organizing Map for the Prize-Collecting Traveling Salesman Problem
In this paper, we propose novel adaptation rules for the selforganizing map to solve the prize-collecting traveling salesman problem (PC-TSP). The goal of the PC-TSP is to find a cost-efficient tour to collect prizes by visiting a subset of a given set of locations. In contrast with the classical traveling salesman problem, where all given locations must be visited, locations in the PC-TSP may ...
متن کاملMulti-Goal Path Planning Using Self-Organizing Map with Navigation Functions
This paper presents a combination of Self-Organizing Map (SOM) approach and navigation functions in the Traveling Salesman Problem with segment goals where paths between goals have to respect obstacles. Hence, the problem is called multi-goal path planning. The problem arises from the inspection planning, where a path from which all points of the given polygonal environment have to be “seen”. T...
متن کاملCHAOSOM: Collaboration between Chaos and Self-Organizing Map
In this study, we try to implant chaotic features into the learning algorithm of self-organizing map. We call this concept as Chaotic SOM (CHAOSOM). As a first step to realize CHAOSOM, we consider the case that learning rate and neighboring coefficient of SOM are refreshed by chaotic pulses generated by the Hodgkin-Huxley equation. We apply the CHAOSOM to solve a traveling salesman problem and ...
متن کاملParallelized neural network system for solving Euclidean traveling salesman problem
We investigate a parallelized divide-and-conquer approach based on a self-organizing map (SOM) in order to solve the Euclidean Traveling Salesman Problem (TSP). Our approach consists of dividing cities into municipalities, evolving the most appropriate solution from each municipality so as to find the best overall solution and, finally, joining neighborhood municipalities by using a blend opera...
متن کامل